Facets for Single Module and Multi-Module Capacitated Lot-Sizing Problems without Backlogging
نویسنده
چکیده
In this paper, we consider the well-known constant-batch lot-sizing problem, which we refer to as the single module capacitated lot-sizing (SMLS) problem, and multi-module capacitated lot-sizing (MMLS) problem. We provide sufficient conditions under which the (k, l, S, I) inequalities of Pochet and Wolsey (Math of OR 18: 767-785, 1993), the mixed (k, l, S, I) inequalities, derived using mixing procedure of Günlük and Pochet (Math. Prog. 90(3): 429-457, 2001), and the paired (k, l, S, I) inequalities, derived using sequential pairing procedure of Guan et al. (Discrete Optimization 4(1): 21-39, 2007), are facet-defining for the SMLS problem without backlogging. We also provide conditions under which the inequalities derived using the sequential pairing and the n-mixing procedure of Sanjeevi and Kianfar (Discrete Optimization 9:216-235, 2012) are facetdefining for the MMLS problem without backlogging.
منابع مشابه
n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
In this paper, we introduce a generalization of the continuous mixing set (which we refer to as the continuous n-mixing set) Qm,n := {(y, v, s) ∈ ( Z× Zn−1 + )m×Rm+1 + : ∑nt=1 αty t + vi + s ≥ βi, i = 1, . . . ,m}. This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. For each n′ ∈ {1, . . . , n}, we develop a class of va...
متن کاملAn optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
An Optimization Framework for Solving Capacitated Multi-level Lot-sizing Problems with Backlogging Tao Wu†, Leyuan Shi†,>, Joseph Geunes‡, Kerem Akartunalı∗ † Department of Industrial and Systems Engineering, University of Wisconsin-Madison, Madison, WI 53706 ‡ Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611 ∗ Department of Management Science, Univ...
متن کاملStrong Formulations for Multi-item Capacitated Lot Sizing*
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems vnth up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generat...
متن کاملFully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
NP{hard cases of the single{item capacitated lot{sizing problem have been the topic of extensive research and continue to receive considerable attention. However, surprisingly few theoretical results have been published on approximation methods for these problems. To the best of our knowledge, until now no polynomial approximation method is known which produces solutions with a relative deviati...
متن کاملLot Sizing and Scheduling in Flow Shop with Sequence-Dependent Setups and Backlogging
Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied
متن کامل